INCOMPLETE RANDOMIZED BLOCKS

On balanced incomplete-block designs with repeated blocks

Balanced incomplete-block designs (BIBDs) with repeated blocks are studied and constructed. We continue work initiated by van Lint and Ryser in 1972 and pursued by van Lint in 1973. We concentrate on constructing (v, b, r, k, λ)-BIBDs with repeated blocks, especially those with gcd(b, r, λ) = 1 and r ≤ 20. We obtain new bounds for the multiplicity of a block in terms of the parameters of a BIBD...

Multiple sequence alignment by combining incomplete blocks of similar segments

We have developed a novel method for multiple sequence alignment based on combinatorial selection of similar block candidates. Our method resembles manual multiple alignment performed by biologists. The method is more feasible for nding functional motifs than previous multiple alignment algorithms that are extensions of pairwise alignments. We employed a Hop eld neural network technique so that...

A Memetic Algorithm for Designing Balanced Incomplete Blocks

The generation of balanced incomplete block designs (BIBD) is a hard constrained combinatorial problem whose applications are manifold. Although the BIBD problem can be easily formulated as a combinatorial optimization problem, its resolution still constitutes a formidable challenge for solving techniques. In this work we devise a memetic algorithm (MA) for tackling the BIBD problem. This MA fe...

SCADDAR: An Efficient Randomized Technique to Reorganize Continuous Media Blocks

Scalable storage architectures allow for the addition of disks to increase storage capacity and/or bandwidth. In its general form, disk scaling also refers to disk removals when either capacity needs to be conserved or old disk drives are retired. Assuming random placement of blocks on multiple nodes of a continuous media server, our optimization objective is to redistribute a minimum number of...

Image Reconstruction from Incomplete Data